Consider the machine M:Q. The language recognized by M is :a){w {a, b}* / every a in w is followed by exactly two bs}b){w {a, b}* every a in w is followed by at least two b}c){w {a, b}* w contains the substring abb}d){w {a, b}* w does not contain aa as a substring}Correct answer is option 'B'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the machine M:Q. The language recogn...

Join the Discussion on the App

Consider the machine M:

Q. The language recognized by M is :

a)
{w ∈ {a, b}* / every a in w is followed by exactly two b's}
b)
{w ∈ {a, b}* every a in w is followed by at least two b’}
c)
{w ∈ {a, b}* w contains the substring 'abb'}
d)
{w ∈ {a, b}* w does not contain 'aa' as a substring}

Correct answer is option 'B'. Can you explain this answer?

FREE This question is part of

Test: Regular Expressions & Finite Automata- 2

Attempt Test

Attempt this Test

Verified Answer

Consider the machine M:Q. The language recognized by M is :a){w ∈...

Here w ∈ {a, b}* means w can be any string from the set of {a, b}* and {a, b}* is set of all strings composed of a and b (any string of a and b that you can think of) like null, a, b, aaa, abbaaa, bbbbb, aaaaa, aaaabbbbaabbababab etc.

These type of questions are frequently asked in GATE, where it is asked to choose best fit language among the options. To slove the question like this, there is a better way, we try to eliminate wrong options by choosing testing strings intelligently until we are left with one right option.As given in question, let’s we try to eliminate option (A), it recognizes only those string (composed of a and b) in which every a in w is followed by exactly two b’s , so if we take string abbb(three b’s), then it is accepted by machine , so this options is wrong. Now we try to eliminate option (C), it recognizes only those strings(composed of a and b) in which w contains the substring ‘abb’, so if we take string abbaa (has substring abb), then it is not accepted by machine, so this options is also wrong. Now we try to eliminate option (D), it recognizes only those string(composed of a and b) in which w does not contains ‘aa’ as a substring , so if we take string abbaba(‘aa’ not as a substring), then it is not accepted by machine ,so this options is also wrong. Only option with which we are left, is option (b) in which every a in w is followed by at least two b’ ,is correct.So answer is option (B).

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros.For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length lessthan 3 are also in the language. A partially completed DFA that accepts this language is shownbelow.The missing arcs in the DFA are

View answer

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below The missing arcs in the DFA are

View answer

Consider the language L1,L2,L3 as given below. L1={| p,qN} L2={| p,qN and p=q} L3={| p,q,rN and p=q=r} Which of the following statements isNOT TRUE?

View answer

Which of the following is the corresponding Language to the given DFA?

View answer

If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer?.

Solutions for Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer?, a detailed solution for Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the machine M:Q. The language recognized by M is :a){w ∈ {a, b}* / every a in w is followed by exactly two b's}b){w ∈ {a, b}* every a in w is followed by at least two b’}c){w ∈ {a, b}* w contains the substring 'abb'}d){w ∈ {a, b}* w does not contain 'aa' as a substring}Correct answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam